Free multiflows in bidirected and skew-symmetric graphs
نویسندگان
چکیده
منابع مشابه
Free multiflows in bidirected and skew-symmetric graphs
A graph (digraph) G = (V,E) with a set T ⊆ V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and leaving v are equal). Cherkassky [1] and Lovász [15] showed that the maximum number of pairwise edge-disjoint T -paths in an inner Eulerian graph G is equal to 1 2 ∑ s∈T λ(s), where λ(s) is the minimum number of edges whose remova...
متن کاملPotentials in Undirected Graphs and Planar Multiflows
The duality relation between shortest paths and potentials in directed graphs and the significance of both of these in the theory of network flows is well known. In this paper, we work out the analogous undirected notions, which neither are contained in nor contain their directed counterpart. They are more related to matching theory than to network flows: the corresponding min-path-max-potentia...
متن کاملOn flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...
متن کاملMaking Bidirected Graphs Strongly Connected
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious...
متن کاملDirectionally 2-signed and Bidirected Graphs
An edge uv in a graph Γ is directionally 2-signed (or, (2, d)signed) by an ordered pair (a, b), a, b ∈ {+, −}, if the label l(uv) = (a, b) from u to v, and l(vu) = (b, a) from v to u. Directionally 2-signed graphs are equivalent to bidirected graphs, where each end of an edge has a sign. A bidirected graph implies a signed graph, where each edge has a sign. We extend a theorem of Sriraj and Sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.02.012